Recursive Ambiguity and Machina's Examples

نویسندگان

  • David Dillenberger
  • Uzi Segal
چکیده

Machina (2009, 2012) lists a number of situations where standard models of ambiguity aversion are unable to capture plausible features of ambiguity attitudes. Most of these problems arise in choice over prospects involving three or more outcomes. We show that the recursive non-expected utility model of Segal (1987) is rich enough to accommodate all these situations. JEL Classification number: D81

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intertemporal substitution and recursive smooth ambiguity preferences

In this paper, we establish an axiomatically founded generalized recursive smooth ambiguity model that allows for a separation among intertemporal substitution, risk aversion, and ambiguity aversion. We axiomatize this model using two approaches: the second-order act approach à la Klibanoff et al. (2005) and the twostage randomization approach à la Seo (2009). We characterize risk attitude and ...

متن کامل

Ambiguity resolution in incremental parsing of natural language

Incremental parsing gains its importance in natural language processing and psycholinguistics because of its cognitive plausibility. Modeling the associated structures is believed to help a better understanding of the human parser. In earlier work we have introduced a recursive neural network capable of performing syntactic ambiguity resolution in incremental parsing. In this paper we report a ...

متن کامل

Ambiguity of ω-Languages of Turing Machines

An ω-language is a set of infinite words over a finite alphabet X . We consider the class of recursive ω-languages, i.e. the class of ω-languages accepted by Turing machines with a Büchi acceptance condition, which is also the class Σ 1 of (effective) analytic subsets of Xω for some finite alphabet X . We investigate the notion of ambiguity for recursive ωlanguages with regard to acceptance by ...

متن کامل

Intertemporal Substitution and Recursive Smooth Ambiguity Preferences ∗ Takashi Hayashi

In this paper, we establish an axiomatically founded generalized recursive smooth ambiguity model that allows for a separation among intertemporal substitution, risk aversion, and ambiguity aversion. We axiomatize this model using two approaches: the second-order act approach à la Klibanoff, Marinacci, and Mukerji (2005) and the two-stage randomization approach à la Seo (2009). We characterize ...

متن کامل

A real-time recursive dynamic model for vehicle driving simulators

This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012